Coalgebraic Automata Theory: Basic Results
نویسندگان
چکیده
منابع مشابه
Coalgebraic Automata Theory: Basic Results
We generalize some of the central results in automata theory to the abstraction level of coalgebras and thus lay out the foundations of the theory of coalgebra automata. In particular, we prove the following results for any functor F that preserves weak pullbacks. We show that the class of recognizable languages of F-coalgebras is closed under taking unions, intersections, and projections. We a...
متن کاملSelf-modifying Finite Automata | Basic Deenitions and Results Self-modifying Finite Automata | Basic Deenitions and Results
We formally de ne the Self-Modifying Finite Automaton (SMFA), a model of computation introduced in [RS93, RS94, RS95], as a subclass of a new more general model, the Self-Modifying Automaton (SMA). SMAs are similar to standard nite automata, but changes to the transition set are allowed during a computation. An SMFA is constrained in that it can have only nitely many di erent modi cation instru...
متن کاملCoalgebraic Predicate Logic: Equipollence Results and Proof Theory
The recently introduced Coalgebraic Predicate Logic (CPL) provides a general first-order syntax together with extra modal-like operators that are interpreted in a coalgebraic setting. The universality of the coalgebraic approach allows us to instantiate the framework to a wide variety of situations, including probabilistic logic, coalition logic or the logic of neighbourhood frames. The last ca...
متن کاملCoalgebraic constructions of canonical nondeterministic automata
For each regular language L we describe a family of canonical nondeterministic acceptors (nfas). Their construction follows a uniform recipe: build the minimal dfa for L in a locally finite variety V, and apply an equivalence between the category of finite V-algebras and a suitable category of finite structured sets and relations. By instantiating this to different varieties, we recover three w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2008
ISSN: 1860-5974
DOI: 10.2168/lmcs-4(4:10)2008